How to Solve an Allocation Problem?
نویسندگان
چکیده
Game theory proposes several allocation solutions: we know (a) fairness properties, (b) how to develop (c) methods building on these properties, and (d) how to calculate (e) allocations. We also know how to influence the perceived fairness and realization of allocation solutions. However, we cannot explain properly that theoretically fair allocation methods are rarely used. To obtain more insight into these issues we solved an allocation problem in a purchasing cooperative case study by confronting theory with perceptions. We find large theoretical and perception differences and inconsistencies between and within the five steps from a to e. We note that theoretically fair methods tend to be more complex than theoretically unfair methods. In addition, the allocations of some simple methods are perceived fairer than the allocations of complex methods in our case study. To improve theoretical solutions the focus should be on a and c. To influence perceptions the focus should be on b, c, and d. Finally, all five steps are modeled into comparable fairness measures and a general model. Using this model implies that both theory and perceptions are considered in solving allocation problems.
منابع مشابه
Allocation of Posts to a Tele-Communication Center Through Kavos (RESEARCH NOTE)
Every phone company customer in a given region receives phone services from a switching center through intermediate points called kavos. The problem addressed in this paper is where to locate this central facility and the kavos, how many of them and with what capacity, so that the total cable length is minimized. This problem can be formulated as a 0-1 mixed integer program; However, because of...
متن کاملGenetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملComparing Three Proposed Meta-heuristics to Solve a New p-hub Location-allocation Problem
This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...
متن کاملBi-objective optimization of multi-server intermodal hub-location-allocation problem in congested systems: modeling and solution
A new multi-objective intermodal hub-location-allocation problem is modeled in this paper in which both the origin and the destination hub facilities are modeled as an M/M/m queuing system. The problem is being formulated as a constrained bi-objective optimization model to minimize the total costs as well as minimizing the total system time. A small-size problem is solved on the GAMS software t...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006